Pyrgg: Python Random Graph Generator
نویسندگان
چکیده
منابع مشابه
Random Graph Generator for Bipartite Networks Modeling
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of parameters. We adapt the advances of last decade in unipartite complex networks modeling to the bigraph setting. This data structure can be observed in several si...
متن کاملA mathematical analysis of the R-MAT random graph generator
The R-MAT graph generator introduced by Chakrabarti, Faloutsos, and Zhan [6] offers a simple, fast method for generating very large directed graphs. These properties have made it a popular choice as a method of generating graphs for objects of study in a variety of disciplines, from social network analysis to high performance computing. We analyze the graphs generated by R-MAT and model the gen...
متن کاملWeighted graph algorithms with Python
Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are instances of the Edge class. Graphs are instances of the Graph class. It is based on the adjacency-list representation, but with fast lookup of nodes and neig...
متن کاملHyperbolic Graph Generator
Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-...
متن کاملEfficient Parallel Graph Algorithms in Python
Domain experts in a variety of fields utilize large-scale graph analysis; however, creating high-performance parallel graph applications currently involves expertise in both graph theory and parallel programming which might not be available to the domain specialist. This project explores methods for bringing efficient parallel performance to graph applications written in Python using selective ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Open Source Software
سال: 2017
ISSN: 2475-9066
DOI: 10.21105/joss.00331